On Polynomial-Based Projection Indices for Exploratory Projection Pursuit
نویسندگان
چکیده
منابع مشابه
Localized Exploratory Projection Pursuit
Based on CART, we introduce a recursive partitioning method for high dimensional space which partitions the data using low dimensional features. The low dimensional features are extracted via an exploratory projection pursuit (EPP) method, localized to each node in the tree. In addition, we present an exploratory splitting rule that is potentially less biased to the training data. This leads to...
متن کاملProjection Pursuit for Exploratory Supervised Classification
In high-dimensional data, one often seeks a few interesting low-dimensional projections that reveal important features of the data. Projection pursuit is a procedure for searching high-dimensional data for interesting low-dimensional projections via the optimization of a criterion function called the projection pursuit index. Very few projection pursuit indices incorporate class or group inform...
متن کاملCombining Exploratory Projection Pursuit and Projection Pursuit Regression with Application to Neural Networks
Parameter estimation becomes difficult in high-dimensional spaces due to the increasing sparseness of the data. Therefore, when a low-dimensional representation is embedded in the data, dimensionality reduction methods become useful. One such method-projection pursuit regression (Friedman and Stuetzle 1981 (PPR)-is capable of performing dimensionality reduction by composition, namely, it constr...
متن کاملMulti-Objective Genetic Programming Projection Pursuit for Exploratory Data Modeling
For classification problems, feature extraction is a crucial process which aims to find a suitable data representation that increases the performance of the machine learning algorithm. According to the curse of dimensionality [4] theorem, the number of samples needed for a classification task increases exponentially as the number of dimensions (variables, features) increases. On the other hand,...
متن کاملA Projection Pursuit Algorithm for Exploratory Data Analysis
An algorithm for the analysis of multivariate data is presented, and discussed in terms of specific examples. The algorithm seeks to find oneand two-dimensional linear projections of multivariate data that are relatively highly revealing. *Supported by the U.S. Atomic Energy Commission under Contract AT(@+3)515. **Prepared in part in connection with research at Princeton University supported by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1989
ISSN: 0090-5364
DOI: 10.1214/aos/1176347127